A criterion on the semisimple Brauer algebras

نویسنده

  • Hebing Rui
چکیده

In this paper, we give a necessary and sufficient condition for a Brauer algebra to be semisimple.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algorithm to compute the Wedderburn decomposition of semisimple group algebras implemented in the GAP package wedderga

We present an algorithm to compute the Wedderburn decomposition of semisimple group algebras based on a computational approach of the Brauer-Witt theorem. The algorithm was implemented in the GAP package wedderga.

متن کامل

On the Representation Theory of Partial Brauer Algebras

In this paper we study the partial Brauer C-algebras Rn(δ, δ ), where n ∈ N and δ, δ ∈ C. We show that these algebras are generically semisimple, construct the Specht modules and determine the Specht module restriction rules for the restriction Rn−1 →֒ Rn. We also determine the corresponding decomposition matrix, and the Cartan decomposition matrix.

متن کامل

Combinatorial Gelfand Models for Semisimple Diagram Algebras

We construct combinatorial (involutory) Gelfand models for the following diagram algebras in the case when they are semi-simple: Brauer algebras, their partial analogues, walled Brauer algebras, their partial analogues, Temperley-Lieb algebras, their partial analogues, walled Temperley-Lieb algebras, their partial analogues, partition algebras and their Temperley-Lieb analogues.

متن کامل

On the Semi-simplicity of the Cyclotomic Brauer Algebras

In this paper, a criterion on the semi-simplicity of the cyclotomic Brauer algebras is given. This result can be considered as a generalization of Wenzl’s theorem on Brauer algebras [27], which was known as Hanlon-Wales conjecture before.

متن کامل

Computing the Wedderburn decomposition of group algebras by the Brauer-Witt theorem

We present an alternative constructive proof of the Brauer–Witt theorem using the so-called strongly monomial characters that gives rise to an algorithm for computing the Wedderburn decomposition of semisimple group algebras of finite groups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 111  شماره 

صفحات  -

تاریخ انتشار 2005